神经网络法计算镉（Ⅱ）,羟基及碳酸根三元体系的形态分布

采用前馈线笥网络ＢＰ算法，计算了Ｃｄ６２＋－ＯＨ＾－ＣＯ＾２－３三元体系的累积稳定常数。用Ｈｏｐｆｉｅｌｄ反馈网络研究了体系中络合物的形态分布。溶液中溶解的ＣＯ２对ｌｇβ１的计算结果有重要影响，对ｌｇβ２，ｌｇβ３，ｌｇβ４的结果影响不大。     

Max—min神经网络的一种有效学习算法

本文在Ａ．Ｂｌａｎｃｏ等人的算法的基础上，提出了ｍａｘ－ｍｉｎ神经网络的一种改进了的反馈学习算法，严格证明了该算法的迭代收敛性，理论分析及实例计算结果均表明，本文算法具有算法简单，收敛速度快，输出误差小等显著特点。     

Selective quenching of tryptophanyl fluorescence in bovine serum albumin by the iodide ion

Modified Stern-Volmer equation is obeyed by bovine serum albumin (BSA)-iodide system showing selective quenching of tryptophanyl fluorescence of BSA. The fraction of accessible protein fluorescence is 0.56 and the effective Stern-Volmer constant is 290 M^-1 at pH 7.4 in 0.005 M phosphate buffer at 25°C. Collisional quenching is operative both in the BSA -I⁻¹ system and the model system, tryptophan-I⁻¹. It is supported by the observed relationship between the ratio of quenching rate constants (k _q ) and diffusion coefficients and alsok _q with bulk viscosity.     

一类非线性单调型方程的区域分裂法

本文考虑了一类非线性单调问题的加性Schwgrz交替法和异步平行算法,并得到了在能量模意义下的收敛性结果,最后还讨论了格式的有限元离散。     

Miscible blends of modified poly(aryl ether ketones) with aromatic polyimides

The phase behavior of binary blends of poly(ether ether ketone) (PEEK), sulfonated PEEK, and sulfamidated PEEK with aromatic polyimides is reported. PEEK was determined to be immiscible with a poly(amide imide) (TORLON 4000T). Blends of sulfonated and sulfamidated PEEK with this poly(amide imide), however, are reported here to be miscible in all proportions. Blends of sulfonated PEEK and a poly(ether imide) (ULTEM 1000) are also reported to be miscible. Spectroscopic investigations of the intermolecular interactions suggest that formation of electron donoracceptor complexes between the sulfonated/sulfamidated phenylene rings of the PEEKs and the n-phenylene units of the polyimides are responsible for this miscibility. © 1993 John Wiley & Sons, Inc.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

e-A深度非弹性散射中胶子辐射振幅的新计算方法

在e-A深度非弹性散射过程中, 喷注穿过冷核介质时, 多重散射诱导胶子辐射会导致对碎裂函数的修正及喷注的能量损失.前期研究中关于计算e-A深度非弹性散射中胶子辐射振幅的两种方法: 螺旋振幅近似和微扰QCD严格计算都异常繁杂. 本文发展了一种新的方法, 可以方便计算出多重散射导致胶子辐射的振幅, 得到的碎裂函数的修正以及能量损失与严格计算的结果一致.     

Mutual solubilities of hydrocarbons and water with the CPA EoS

The knowledge of hydrocarbon/water phase equilibria is important in the design and operation of equipment for petroleum transport and refining and petrochemical plants. The presence of water in a hydrocarbon mixture can affect the product quality and damage the operation equipment due to corrosion and formation of gas hydrates. Tracing the concentration of hydrocarbons in aqueous media is also important for technical purposes like preventing oil spills and for ecological concerns such as predicting the fate of these organic pollutants in the environment.     

求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.     

Fast algorithms for determining the linear complexities of sequences over GF(pm) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m − 1 are coprime) more efficiently.